Harmonic Functions on Planar and Almost Planar Graphs and Manifolds, via Circle Packings

نویسنده

  • Itai Benjamini
چکیده

The circle packing theorem is used to show that on any bounded valence transient planar graph there exists a non constant, harmonic, bounded, Dirichlet function. If P is a bounded circle packing in R 2 whose contacts graph is a bounded valence triangulation of a disk, then, with probability 1, the simple random walk on P converges to a limit point. Moreover, in this situation any continuous function on the limit set of P extends to a continuous harmonic function on the closure of the contacts graph of P ; that is, this Dirichlet problem is solvable. We deene the notions of almost planar graphs and manifolds, and show that under the assumptions of transience and bounded local geometry these possess non constant, harmonic, bounded, Dirichlet functions. Let us stress that an almost planar graph is not necessarily roughly isometric to a planar graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boundaries of Planar Graphs, via Circle Packings

We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc (this packing is unique up to Möbius transformations). More precisely, we show that any bounded harmonic function on the graph is the harmonic extension of some measurable function on the boundary of the disk, and th...

متن کامل

Balanced Circle Packings for Planar Graphs

We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle’s diameter to the smallest circle’s diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.

متن کامل

Primal-dual Circle packing of Planar Maps

This work is based on Mohar [1]’s recent algorithm for circle packing for the Euclean case. We implement his polynomial time algorithm for constructing primal-dual circle packings of almost 3-connected planar maps. We have improved Mohar’s algorithm and have been able to get near an order of magnitude speed up for large graphs. We describe our implementation in C/C++ style pseudo-code.

متن کامل

Planar Lombardi Drawings for Subcubic Graphs

We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...

متن کامل

Circle Packings of Maps - the Euclidean Case

In an earlier work, the author extended the AndreevKoebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual circle packings of arbitrary (essentially) 3-connected maps was found. In this note, additional details concerning surfaces of constant curvature 0 (with special emphasis on planar graphs where a slightly different treatment is necessar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007